Dynamic Priority Rule Selection for Solving Multi-objective Job Shop Scheduling Problems
نویسندگان
چکیده
منابع مشابه
Solving Flexible Job Shop Scheduling with Multi Objective Approach
In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...
متن کاملAn algorithm for multi-objective job shop scheduling problem
Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...
متن کاملSolving Flexible Job Shop Scheduling with Multi Objective Approach
In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Paretooptimal s...
متن کاملDerleme Makalesi MULTI OBJECTIVE FLEXIBLE JOB SHOP SCHEDULING PROBLEMS
Flexible job shop scheduling problem, is an extension of the classical job shop scheduling problem. In Flexible job shop scheduling problem, there are more than one machine with the same features for the same purpose. The problem can be defined as appointing the jobs to the machines (assignment) and ordering the jobs at each machine (sequencing) to serve the desired purpose. Multi-objective fle...
متن کاملA hybrid discrete firefly algorithm for solving multi-objective flexible job shop scheduling problems
Firefly Algorithm (FA) is a nature-inspired optimization algorithm that can be successfully applied to continuous optimization problems. However, lot of practical problems are formulated as discrete optimization problems. In this paper a hybrid discrete firefly algorithm (HDFA) is proposed to solve the multi-objective flexible job shop scheduling problem (FJSP). FJSP is an extension of the clas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Universal Journal of Industrial and Business Management
سال: 2018
ISSN: 2332-3310,2332-3329
DOI: 10.13189/ujibm.2018.060102